A Beautiful Proof by Induction
نویسنده
چکیده
The purpose of this note is to present an example of a proof by induction that in the opinion of the present author has great aesthetic value. The proof in question is Thomassen’s proof that planar graphs are 5-choosable. I give a self-contained presentation of this result and its proof, and a personal account of why I think this proof is beautiful. A secondary purpose is to more widely publicize this gem, and hopefully make it part of a standard set of examples for examining characteristics of proofs by induction.
منابع مشابه
Recursive projections of symmetric tensors and Marcus’s proof of the Schur inequality
In a 1918 paper [Sch18], Schur proved a remarkable inequality that related group representations, Hermitian forms and determinants. He also gave concise necessary and sufficient conditions for equality. In [Mar64], Marcus gave a beautiful short proof of Schur’s inequality by applying the Cauchy-Schwarz inequality to symmetric tensors, but he did not discuss the case of equality. In [Wil69], Wil...
متن کاملA Condensed Condensation Proof of a Determinant Evaluation Conjectured by Greg Kuperberg and Jim Propp
holds with X = L. Since Lm(a, b) = Rm(a, b) for m = 0, 1 (check!), and the recurrence also holds with X = R (check! ), it follows by induction that Lm(a, b) = Rm(a, b) for all m. . The present proof is in the spirit of [Z1]. Another proof can be found in [A1]. The same method yields a q-analog of (Rabbit), that can be found in [A2]. A beautiful combinatorial proof of (Lewis) can be found in [Z2...
متن کاملOn the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang’s Conjecture
The purpose of this paper is twofold. First we derive theoretically, using appropriate transformation on x(n), the closed-form solution of the nonlinear difference equation x(n+1) = 1/(±1 + x(n)), n ∈ N_0. The form of solution of this equation, however, was first obtained in [10] but through induction principle. Then, with the solution of the above equation at hand, we prove a case ...
متن کاملFunctional Programming 1 First - Order Uni cation by Structural
First-order uniication algorithms (Robinson, 1965) are traditionally implemented via general recursion, with separate proofs for partial correctness and termination. The latter tends to involve counting the number of unsolved variables and showing that this total decreases each time a substitution enlarges the terms. There are many such proofs in the This paper shows how a dependent type can re...
متن کاملA Distribution Relation on Elliptic Curves
In this paper, we give an elementary proof of a curious identity of elliptic functions. It is very similar to a beautiful proof given by Coates of a different identity. The result was strongly motivated by Wildeshaus’s generalisation of Zagier’s conjecture.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016